On Spanning Tree Congestion of Product Graphs
نویسنده
چکیده
In this paper we consider the spanning tree congestion for several families of graphs. We find the exact spanning tree congestion for toroidal meshes, Cm×Cn, and cylindrical meshes, Pm×Cn,. Also we find bounds for the spanning tree congestion of Qn, and a construction that gives the upper bound.
منابع مشابه
Spanning tree congestion of some product graphs
We estimate spanning tree congestion for cartesian products of paths and complete graphs.
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملOn spanning tree congestion of Hamming graphs
We present a tight lower bound for the spanning tree congestion of Hamming graphs.
متن کاملMinimum congestion spanning trees in bipartite and random graphs
The first problem considered in this paper: is it possible to find upper estimates for the spanning tree congestion for bipartite graphs which are better than for general graphs? It is proved that there exists a bipartite version of the known graph with spanning tree congestion of order n 3 2 , where n is the number of vertices. The second problem is to estimate spanning tree congestion of rand...
متن کاملSpanning tree congestion: duality and isoperimetry. With an application to multipartite graphs
In this paper we (1) Describe two approaches to estimates of the spanning tree congestion from below; (2) Use the isoperimetric approach to find the exact value of the spanning tree congestion of complete multipartite graphs; (3) Present a proof of the isoperimetric result of Piliposyan-Muradyan for complete multipartite graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007